A Robust Aggregation Tree on Distributed Hash Tables
نویسنده
چکیده
As P2P networks grow in popularity, there is an emerging need to collect aggregate information from such systems on the parts of both administrators and application users, such as available network storage, computation capabilities, and network size estimation for randomized DHTs. Our goal is to enable a P2P network to compute an aggregation function (MIN, MAX, COUNT, SUM, AVG) over data residing at nodes or over the network itself.
منابع مشابه
Implementing Aggregation/Broadcast over Distributed Hash Tables
We present an algorithm for implementing aggregation/broadcast over existing Distributed Hash Tables (DHTs). Our algorithm builds an aggregation tree in a bottom-up fashion by mapping nodes to their parents in the aggregation tree with pre-determined function and maintains it using soft-state. We believe that the aggregation/broadcast function is a basic service that should be layered over exis...
متن کاملPrefix Hash Tree An Indexing Data Structure over Distributed Hash Tables
Distributed Hash Tables are scalable, robust, and self-organizing peer-to-peer systems that support exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient (update...
متن کاملRange Queries over DHTs
Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) – a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take DHT lookups, where D is the data domain be...
متن کاملImplementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we support range queries through a balanced tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B-tree design that efficiently stores clustered data while maintainin...
متن کاملEfficient Content Authentication over Distributed Hash Tables
We study a new model for data authentication over peer-to-peer storage networks, where data is stored, queried and authenticated in a totally distributed fashion. The model captures the security requirements of emerging distributed computing applications. We present an efficient implementation of a distributed Merkle tree, which realizes a Merkle tree over a peer-to-peer network, thus extending...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004